Forests on wired regular trees
نویسندگان
چکیده
The Arboreal gas model on a finite graph $G$ is the Bernoulli bond percolation conditioned event that sampled subgraph forest. In this short note we study arboreal regular tree wired at leaves and obtain comprehensive description of weak limit model.
منابع مشابه
Covering regular graphs with forests of small trees
A (d, k) -forest is a forest consisting of trees whose diameters are at most d and whose maximum vertex degree ,6. is at most k. The (d, k)-arboricity of a graph G is the minimum number of (d, k}-forests needed to cover E(G). This concept is a common generalization of linear k-arboricity and star arboricity. Using a probabilistic approach developed recently for linear karboricity, we obtain an ...
متن کاملInvasion percolation on regular trees
We consider invasion percolation on a rooted regular tree. For the infinite cluster invaded from the root, we identify the scaling behaviour of its r-point function for any r ≥ 2 and of its volume both at a given height and below a given height. In addition, we derive scaling estimates for simple random walk on the cluster starting from the root. We find that while the power laws of the scaling...
متن کاملReconstruction Thresholds on Regular Trees
We consider the model of broadcasting on a tree, with binary state space, on the infinite rooted tree k in which each node has k children. The root of the tree takes a random value 0 or 1, and then each node passes a value independently to each of its children according to a 2 2 transition matrix P. We say that reconstruction is possible if the values at the dth level of the tree contain non-va...
متن کاملForests of Decision Trees
In many cases it is better to extract a set of decision trees and a set of possible logical data descriptions instead of a single model. Methods for creating forests of decision trees based on Separability of Split Value (SSV) criterion are presented. Preliminary results confirm their usefulness in understanding data structures.
متن کاملThe Williams Bjerknes Model on Regular Trees
We consider the Williams Bjerknes model, also known as the biased voter model on the d-regular tree T, where d ≥ 3. Starting from an initial configuration of “healthy” and “infected” vertices, infected vertices infect their neighbors at Poisson rate λ ≥ 1, while healthy vertices heal their neighbors at Poisson rate 1. All vertices act independently. It is well known that starting from a configu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ALEA-Latin American Journal of Probability and Mathematical Statistics
سال: 2022
ISSN: ['1980-0436']
DOI: https://doi.org/10.30757/alea.v19-42